Convex Multi-class Image Labeling by Simplex-Constrained Total Variation

نویسندگان

  • Jan Lellmann
  • Jörg H. Kappes
  • Jing Yuan
  • Florian Becker
  • Christoph Schnörr
چکیده

Multi-class labeling is one of the core problems in image analysis. We show how this combinatorial problem can be approximately solved using tools from convex optimization. We suggest a novel functional based on a multidimensional total variation formulation, allowing for a broad range of data terms. Optimization is carried out in the operator splitting framework using Douglas-Rachford Splitting. In this connection, we compare two methods to solve the Rudin-Osher-Fatemi type subproblems and demonstrate the performance of our approach on singleand multichannel images.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An iterated `1 Algorithm for Non-smooth Non-convex Optimization in Computer Vision

Natural image statistics indicate that we should use nonconvex norms for most regularization tasks in image processing and computer vision. Still, they are rarely used in practice due to the challenge to optimize them. Recently, iteratively reweighed `1 minimization has been proposed as a way to tackle a class of non-convex functions by solving a sequence of convex `2-`1 problems. Here we exten...

متن کامل

Convex Multilabel Segmentation with Shearlet Regularization

Segmentation plays an important role in many preprocessing stages in image processing. Recently, convex relaxation methods for image multi-labeling were proposed in the literature. Often these models involve the total variation (TV) semi-norm as regularizing term. However, it is well-known that the TV functional is not optimal for the segmentation of textured regions. In recent years directiona...

متن کامل

Joint reconstruction of multi-channel, spectral CT data via constrained total nuclear variation minimization.

We explore the use of the recently proposed 'total nuclear variation' (TVN) as a regularizer for reconstructing multi-channel, spectral CT images. This convex penalty is a natural extension of the total variation (TV) to vector-valued images and has the advantage of encouraging common edge locations and a shared gradient direction among image channels. We show how it can be incorporated into a ...

متن کامل

Epigraphical splitting for solving constrained convex optimization problems with proximal tools – extended version

We propose a proximal approach to deal with a class of convex variational problems involving nonlinear constraints. A large family of constraints, proven to be effective in the solution of inverse problems, can be expressed as the lower level set of a sum of convex functions evaluated over different blocks of the linearly-transformed signal. For such constraints, the associated projection opera...

متن کامل

A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science

We generalize the primal-dual hybrid gradient (PDHG) algorithm proposed by Zhu and Chan in [M. Zhu, and T. F. Chan, An Efficient Primal-Dual Hybrid Gradient Algorithm for Total Variation Image Restoration, UCLA CAM Report [08-34], May 2008] to a broader class of convex optimization problems. In addition, we survey several closely related methods and explain the connections to PDHG. We point out...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009